Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks

In this paper, we address the problem of k-out-of-` exclusion, a generalization of the mutual exclusion problem, in which there are ` units of a shared resource, and any process can request up to k units (1 ≤ k ≤ `). A protocol is self-stabilizing if, starting from an arbitrary configuration, be it initial state or after a corrupted state, the protocol can start behaving normally within a finite time. We propose the first deterministic self-stabilizing distributed k-out-of-` exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.